Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems
نویسندگان
چکیده
منابع مشابه
Trust{region Interior{point Algorithms for a Class of Nonlinear Programming Problems Trust{region Interior{point Algorithms for a Class of Nonlinear Programming Problems
Trust{Region Interior{Point Algorithms for a Class of Nonlinear Programming Problems by Lu s Nunes Vicente This thesis introduces and analyzes a family of trust{region interior{point (TRIP) reduced sequential quadratic programming (SQP) algorithms for the solution of minimization problems with nonlinear equality constraints and simple bounds on some of the variables. These nonlinear programming...
متن کاملTrust { Region Interior { Point Sqp Algorithms for a Class Ofnonlinear Programming Problems
In this paper a family of trust{region interior{point SQP algorithms for the solution of a class of minimization problems with nonlinear equality constraints and simple bounds on some of the variables is described and analyzed. Such nonlinear programs arise e.g. from the discretization of optimal control problems. The algorithms treat states and controls as independent variables. They are desig...
متن کاملAnalysis of Inexact Trust-Region Interior-Point SQP Algorithms
In this paper we analyze inexact trust–region interior–point (TRIP) sequential quadra– tic programming (SQP) algorithms for the solution of optimization problems with nonlinear equality constraints and simple bound constraints on some of the variables. Such problems arise in many engineering applications, in particular in optimal control problems with bounds on the control. The nonlinear constr...
متن کاملA trust region SQP algorithm for mixed-integer nonlinear programming
We propose a modified sequential quadratic programming (SQP) method for solving mixed-integer nonlinear programming problems. Under the assumption that integer variables have a smooth influence on the model functions, i.e., that function values do not change drastically when inor decrementing an integer value, successive quadratic approximations are applied. The algorithm is stabilized by a tru...
متن کاملObject Library of Algorithms for Dynamic Optimization Problems: Benchmarking SQP and Nonlinear Interior Point Methods
The main purpose of this paper is to describe the design, implementation and possibilities of our object-oriented library of algorithms for dynamic optimization problems. We briefly present library classes for the formulation and manipulation of dynamic optimization problems, and give a general survey of solver classes for unconstrained and constrained optimization. We also demonstrate methods ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Control and Optimization
سال: 1998
ISSN: 0363-0129,1095-7138
DOI: 10.1137/s036012995279031